A Combined Logarithmic Bound on the Chromatic Index of Multigraphs
نویسنده
چکیده
For any multigraph G of order n, let Φ(G) denote the integer roundup of its fractional chromatic index. We show that the chomatic index χ (G) satisfies χ (G) ≤ Φ(G) + log(min{ n + 1 3 , Φ(G)}). The method used is deterministic (though it extends a famous probabilistic result by Kahn), and different from the re-coloring techniques that are the basis for many of the other known upper bounds on χ (G).
منابع مشابه
The chromatic index of multigraphs of order at most 10
The maximum of the maximum degree and the 'odd set quotients' provides a well-known lower bound 4)(G) for the chromatic index of a multigraph G. Plantholt proved that if G is a multigraph of order at most 8, its chromatic index equals qS(G) and that if G is a multigraph of order 10, the chromatic index of G cannot exceed qS(G) + 1. We identify those multigraphs G of order 9 and 10 whose chromat...
متن کاملSome maximum multigraphs and adge/vertex distance colourings
Shannon–Vizing–type problems concerning the upper bound for a distance chromatic index of multigraphs G in terms of the maximum degree ∆(G) are studied. Conjectures generalizing those related to the strong chromatic index are presented. The chromatic d–index and chromatic d–number of paths, cycles, trees and some hypercubes are determined. Among hypercubes, however, the exact order of their gro...
متن کاملA new approach to compute acyclic chromatic index of certain chemical structures
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerfu...
متن کاملA sublinear bound on the chromatic index of multigraphs
The integer round-up 4(G) of the fractional chromatic index yields the standard lower bound for the chromatic index of a multigraph G. We show that if G has even order n, then the chromatic index exceeds 4(G) by at most max{log,,, n, 1 + n/30}. More generally, we show that for any real b, 2/3 <b < 1, the chromatic index of G exceeds 4(G) by at most max{log,,b n, 1 +n(l b)/lO}. This is used to s...
متن کاملAsymptotics of the total chromatic number for multigraphs
For loopless multigraphs, the total chromatic number is asymptotically its fractional counterpart as the latter invariant tends to infinity. The proof of this is based on a recent theorem of Kahn establishing the analogous asymptotic behaviour of the list-chromatic index for multigraphs. The total colouring conjecture, proposed independently by Behzad [1] and Vizing [11], asserts that the total...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 73 شماره
صفحات -
تاریخ انتشار 2013